;;; breadth first search functions

(defun bsearch (p0) (bs p0 NIL))

(defun bs (p qu) 
  (cond ((winning p) p) 
	((losing p) (bsl qu))
	(T (bsl (append qu (successors p)))) ))

(defun bsl (qu) (cond ((null qu) 'YOU_LOSE) (T (bs (car qu) (cdr qu))) ))